/*
 * @Author: szx
 * @Date: 2022-05-24 13:28:32
 * @LastEditTime: 2022-05-24 13:42:37
 * @Description:
 * @FilePath: \leetcode\面试题\08\11\11.js
 */
/**
 * @param {number} n
 * @return {number}
 */
var waysToChange = function (n) {
    const dp = new Array(n + 1).fill(0),
        MOD = 1000000007;
    dp[0] = 1;
    for (let i = 1; i <= n; i++) {
        if (i >= 5) dp[i] = (dp[i] + dp[i - 5]) % MOD;
        if (i >= 10) dp[i] = (dp[i] + dp[i - 10]) % MOD;
        if (i >= 25) dp[i] = (dp[i] + dp[i - 25]) % MOD;
        dp[i] = (dp[i] + dp[i - 1]) % MOD;
    }
    return dp[n];
};
